Planar graphs

Results: 475



#Item
31Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura†

Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura†

Add to Reading List

Source URL: rutcor.rutgers.edu

- Date: 2011-09-12 05:29:52
    32On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach∗ V. Arvind The Institute of Mathematical Sciences Chennai, India

    On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach∗ V. Arvind The Institute of Mathematical Sciences Chennai, India

    Add to Reading List

    Source URL: www.cs.uwm.edu

    - Date: 2008-03-04 12:22:17
      33Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

      Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

      Add to Reading List

      Source URL: mug.mvapich.cse.ohio-state.edu

      Language: English - Date: 2015-11-20 13:17:47
      34Induced paths of given parity in planar graphs  Naomi Nishimura University of Waterloo Canada

      Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

      Add to Reading List

      Source URL: rutcor.rutgers.edu

      Language: English - Date: 2012-01-04 04:27:26
      35Microsoft Word - paper31.docx

      Microsoft Word - paper31.docx

      Add to Reading List

      Source URL: www.wisdom.weizmann.ac.il

      Language: English - Date: 2013-10-23 08:30:45
      36The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil

      The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil

      Add to Reading List

      Source URL: orion.math.iastate.edu

      Language: English - Date: 2014-08-22 14:44:54
      37UNIVERSITÄT DORTMUND  FACHBEREICH INFORMATIK Diplomarbeit

      UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

      Add to Reading List

      Source URL: ls11-www.cs.tu-dortmund.de

      Language: English - Date: 2008-07-03 09:38:15
      38The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

      The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

      Add to Reading List

      Source URL: orion.math.iastate.edu

      Language: English - Date: 2014-08-22 14:45:55
      39Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

      Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

      Add to Reading List

      Source URL: www.cs.uwm.edu

      Language: English - Date: 2011-07-31 13:36:56
      40Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague  Graph: G = (V , E ), V finite, E ⊆

      Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

      Add to Reading List

      Source URL: kam.mff.cuni.cz

      Language: English - Date: 2015-09-15 10:40:14